Free Distributive Completions of Partial Complete Lattices
نویسنده
چکیده
The free distributive completion of a partial complete lattice is the complete lattice that it is freely generated by the partial complete latticèin the most distributive way'. This can be described as being a universal solution in the sense of universal algebra. Free distributive completions generalize the constructions of tensor products and of free completely distributive complete lattices over partially ordered sets.
منابع مشابه
Profinite Heyting Algebras and Profinite Completions of Heyting Algebras
This paper surveys recent developments in the theory of profinite Heyting algebras (resp. bounded distributive lattices, Boolean algebras) and profinite completions of Heyting algebras (resp. bounded distributive lattices, Boolean algebras). The new contributions include a necessary and sufficient condition for a profinite Heyting algebra (resp. bounded distributive lattice) to be isomorphic to...
متن کاملComparison of MacNeille, Canonical, and Profinite Completions
Using duality theory, we give necessary and sufficient conditions for the MacNeille, canonical, and profinite completions of distributive lattices, Heyting algebras, and Boolean algebras to be isomorphic.
متن کاملRough sets determined by tolerances
We show that for any tolerance R on U , the ordered sets of lower and upper rough approximations determined by R form ortholattices. These ortholattices are completely distributive, thus forming atomistic Boolean lattices, if and only if R is induced by an irredundant covering of U , and in such a case, the atoms of these Boolean lattices are described. We prove that the ordered set RS of rough...
متن کاملDistributive lattices with strong endomorphism kernel property as direct sums
Unbounded distributive lattices which have strong endomorphism kernel property (SEKP) introduced by Blyth and Silva in [3] were fully characterized in [11] using Priestley duality (see Theorem 2.8}). We shall determine the structure of special elements (which are introduced after Theorem 2.8 under the name strong elements) and show that these lattices can be considered as a direct product of ...
متن کاملCanonical Extensions and Profinite Completions of Semilattices and Lattices
Canonical extensions of (bounded) lattices have been extensively studied, and the basic existence and uniqueness theorems for these have been extended to general posets. This paper focuses on the intermediate class S∧ of (unital) meet semilattices. Any S ∈ S∧ embeds into the algebraic closure system Filt(Filt(S)). This iterated filter completion, denoted Filt(S), is a compact and ∨∧ -dense exte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007